The Structure of Evolutionary Exploration: On Crossover, Buildings Blocks, and Estimation-Of-Distribution Algorithms
نویسنده
چکیده
Correlations between alleles after selection are an important source of information. Such correlations should be exploited for further search and thereby constitute the building blocks of evolutionary exploration. With this background we analyze the structure of the offspring probability distribution, or exploration distribution, for a simple GA with mutation only and a crossover GA and compare them to Estimation-Of-Distribution Algorithms (EDAs). This will allow a precise characterization of the structure of exploration w.r.t. correlations in the search distribution for these algorithms. We find that crossover transforms, depending on the crossover mask, mutual information between loci into entropy. In total, it can only decrease such mutual information. In contrast, the objective of EDAs is to estimate the correlations between loci and exploit this information during exploration. This may lead to an effective increase of mutual information in the exploration distribution, what we define correlated exploration.
منابع مشابه
Solving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملEstimation of LPC coefficients using Evolutionary Algorithms
The vast use of Linear Prediction Coefficients (LPC) in speech processing systems has intensified the importance of their accurate computation. This paper is concerned with computing LPC coefficients using evolutionary algorithms: Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Dif-ferential Evolution (DE) and Particle Swarm Optimization with Differentially perturbed Velocity (PSO-DV...
متن کاملOptimal Estimation of Harmonic Components Using ISFLA
In this paper a novel method based on evolutionary algorithms is presented to estimate the harmonic components. In general, the optimization of the harmonic estimation process is a multi-component problem, in which evaluation of the phase and harmonic frequency is the nonlinear part of the problem and is solved based on the mathematical and evolutionary methods; while estimation of amplitude of...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملOPTIMIZATION OF STEEL MOMENT FRAME BY A PROPOSED EVOLUTIONARY ALGORITHM
This paper presents an improved multi-objective evolutionary algorithm (IMOEA) for the design of planar steel frames. By considering constraints as a new objective function, single objective optimization problems turned to multi objective optimization problems. To increase efficiency of IMOEA different Crossover and Mutation are employed. Also to avoid local optima dynamic interference of mutat...
متن کامل